New Bounds for Union-free Families of Sets
نویسندگان
چکیده
Following Frankl and F uredi [1] we say a family, F , of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A[B = C [D. If in addition A[B = A[C implies B = C we say F is strongly union-free. Let f(n) (g(n)) be the maximum size of strongly (weakly) union-free families. In this paper we prove the following new bounds on f and g: 2 f(n) 2 and g(n) 2. AMS Subject Classi cation. 05B10
منابع مشابه
Regular union and cover free families
A family of subsets F of an n-set is r-union-free, if the unions of at most r-tuples of the elements in F are all different. F ⊆ 2 is r-cover-free, if no set in F is covered by the union r others. In this paper we give new bounds on the maximum size of these families in the regular case. In coding theoretical setting union-free families and cover-free families correspond to superimposed designs...
متن کاملApproximation of Definable Sets by Compact Families, and Upper Bounds on Homotopy and Homology
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by quantifier-free formulae, and obtain for the first time a singly exponential bound on Betti numbers of sub-Pfaffian sets.
متن کاملLower Bounds for Cover-Free Families
Let F be a set of blocks of a t-set X . (X,F) is called (w, r)cover-free family ((w, r)−CFF) provided that, the intersection of any w blocks in F is not contained in the union of any other r blocks in F . We give new asymptotic lower bounds for the number of minimum points t in a (w, r)-CFF when w ≤ r = |F|ǫ for some constant ǫ ≥ 1/2.
متن کاملBounds on the rate of disjunctive codes (in Russian)
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998